non - linear programming - traduction vers arabe
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

non - linear programming - traduction vers arabe

SOLUTION PROCESS FOR SOME OPTIMIZATION PROBLEMS
Non-linear programming; Non-Linear programming; Nonlinear optimization; Non-Linear Optimization; Non linear optimization; Applications of nonlinear programming; Methods for solving nonlinear programming problems; Nonlinear Programming

non - linear programming      
عمل البرامج غير الخطية
linear programming         
  • planes]] (not shown). The linear programming problem is to find a point on the polyhedron that is on the plane with the highest possible value.
  • [[John von Neumann]]
  • [[Leonid Kantorovich]]
  • convex]] [[feasible region]] of possible values for those variables. In the two-variable case this region is in the shape of a convex [[simple polygon]].
PROGRAMMING METHOD TO ACHIEVE THE BEST OUTCOME IN A MATHEMATICAL MODEL
Linear program; Linear programme; 0-1 integer programming; Linear Programming; Linear optimization; Mixed integer programming; Lp solve; LP problem; 0–1 integer program; 0-1 linear programming; 0-1 integer program; Linear programmer; Linear programmers; Linear programs; Binary integer programming; Integer programs; Integer linear programs; 0-1 integer programs; Binary integer program; Binary integer programs; Mixed integer program; Mixed integer programs; Linear programming problem; Mixed integer linear programming; 1-0 linear programming; Integral linear program; Linear programming formulation; Linear optimisation; Linear programming Formulation; Integral polyhedron; Linear problem; LP duality; Complementary slackness; Algorithms for linear programming; Linear programming algorithms; Applications of linear programming; List of solvers for linear programming; List of linear programming solvers; History of linear programming; MILP
برمجة خطية
linear program         
  • planes]] (not shown). The linear programming problem is to find a point on the polyhedron that is on the plane with the highest possible value.
  • [[John von Neumann]]
  • [[Leonid Kantorovich]]
  • convex]] [[feasible region]] of possible values for those variables. In the two-variable case this region is in the shape of a convex [[simple polygon]].
PROGRAMMING METHOD TO ACHIEVE THE BEST OUTCOME IN A MATHEMATICAL MODEL
Linear program; Linear programme; 0-1 integer programming; Linear Programming; Linear optimization; Mixed integer programming; Lp solve; LP problem; 0–1 integer program; 0-1 linear programming; 0-1 integer program; Linear programmer; Linear programmers; Linear programs; Binary integer programming; Integer programs; Integer linear programs; 0-1 integer programs; Binary integer program; Binary integer programs; Mixed integer program; Mixed integer programs; Linear programming problem; Mixed integer linear programming; 1-0 linear programming; Integral linear program; Linear programming formulation; Linear optimisation; Linear programming Formulation; Integral polyhedron; Linear problem; LP duality; Complementary slackness; Algorithms for linear programming; Linear programming algorithms; Applications of linear programming; List of solvers for linear programming; List of linear programming solvers; History of linear programming; MILP
برنامج خطي

Définition

linear programming
<application> A procedure for finding the maximum or minimum of a linear function where the arguments are subject to linear constraints. The simplex method is one well known algorithm. (1995-04-06)

Wikipédia

Nonlinear programming

In mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints or the objective function are nonlinear. An optimization problem is one of calculation of the extrema (maxima, minima or stationary points) of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear.